On hardly linearly provable systems

Linearly recurrent systems

A non-erasing morphism σ is said to be recognizable on x if there exists ` such that, for each m ∈ Cσ(x), m′ ∈ Z, y[m−`,m+`) = y[m′−`,m′+`) implies that m′ ∈ Cσ(x), with y = σ(x). Is the Thue-Morse substitution σ : a 7→ ab, b 7→ ba recognizable on σ∞(a)? Same question for the Fibonacci substitution τ : a 7→ ab, b 7→ a. Let σ be a primitive morphism that is recognizable on some x and injective o...

Linearly independent split systems

An important procedure in the mathematics of phylogenetic analysis is to associate, to any collection of weighted splits, the metric given by the corresponding linear combination of split metrics. In this note, we study necessary and sufficient conditions for a collection of splits of a given finite set X to give rise to a linearly independent collection of split metrics. In addition, we study ...

Linearly Derived Steiner Triple Systems

designing unmanned aerial vehicle based on neuro-fuzzy systems

در این پایان نامه، کنترل نرو-فازی در پرنده هدایت پذیر از دور (پهپاد) استفاده شده است ابتدا در روش پیشنهادی اول، کنترل کننده نرو-فازی توسط مجموعه اطلاعات یک کنترل کننده pid به صورت off-line آموزش دیده است و در روش دوم یک کنترل کننده نرو-فازی on-line مبتنی بر شناسایی سیستم توسط شبکه عصبی rbf پیشنهاد شده است. سپس کاربرد این کنترل کننده در پهپاد بررسی شده است و مقایسه ای ما بین کنترل کننده های معمو...

On Carleman Linearization of Linearly Observable Polynomial Systems

Carleman linearization is used to transform a polynomial control system with output, defined on n-dimensional space, into a linear or bilinear system evolving in the space of infinite sequences. Such a system is described by infinite matrices with special properties. Linear observability of the original system is studied. It means that all coordinate functions can be expressed as linear combina...